Multi-Index Syntactical Calculus
نویسنده
چکیده
منابع مشابه
A Syntactical Treatment of Simultaneous Fixpoints in the Modal μ-Calculus
We provide a purely syntactical treatment of simultaneous fixpoints in the modal μ-calculus by proving directly in Kozen’s axiomatisation their properties as greatest and least fixpoints, that is, the fixpoint axiom and the induction rule. Further, we apply our result in order to get a completeness result for characteristic formulae of finite pointed transition systems.
متن کاملThe Hidden Structural Rules of the Discontinuous Lambek Calculus
The sequent calculus sL for the Lambek calculus L ([2]) has no structural rules. Interestingly, sL is equivalent to a multimodal calculus mL, which consists of the nonassociative Lambek calculus with the structural rule of associativity. This paper proves that the sequent calculus or hypersequent calculus hD of the discontinuous Lambek calculus1 ([7], [4] and [8]), which like sL has no structur...
متن کاملOrder-Incompleteness and Finite Lambda Models (Extended Abstract)
Many familiar models of the type-free lambda calculus are constructed by order theoretic methods. This paper provides some basic new facts about ordered models of the lambda calculus. We show that in any partially ordered model that is complete for the theory ofβorβη-conversion, the partial order is trivial on term denotations. Equivalently, the open and closed term algebras of the type-free la...
متن کاملParametric λ-Theories
The parametric lambda calculus subsumes different existing λ-calculi, in particular the classical λβ-calculus and the λβv-calculus of Plotkin. Previously established results on the parametric calculus, such as as confluence and standardization, are primarily syntactical. In this paper our attention is mainly addressed to semantics, although we start again from a syntactical point of view. We pr...
متن کاملA Proof Procedure for Hybrid Logic with Binders, Transitivity and Relation Hierarchies (extended version)
In previous works, a tableau calculus has been defined, which constitutes a decision procedure for hybrid logic with the converse and global modalities and a restricted use of the binder. This work shows how to extend such a calculus to multi-modal logic enriched with features largely used in description logics: transitivity and relation inclusion assertions. The separate addition of either tra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1969